A universal scaling theory for complexity of analog computation
نویسندگان
چکیده
منابع مشابه
A Universal Scaling Theory for Complexity of Analog Computation
We discuss the computational complexity of solving linear programming problems by means of an analog computer. The latter is modeled by a dynamical system which converges to the optimal vertex solution. We analyze various probability ensembles of linear programming problems. For each one of these we obtain numerically the probability distribution functions of certain quantities which measure th...
متن کاملScaling and universality of the complexity of analog computation.
We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We numerically analyze various ensembles of linear programming problems and obtain, for each of these ensembles, the probability distribution functions of certain quantities which measure the computational complexity, known as the convergence rate, the barrier and...
متن کاملThe Complexity of Analog Computation †
We ask if analog computers can solve NP-complete problems efficiently. Regarding this as unlikely, we formulate a strong version of Church’s Thesis: that any analog computer can be simulated efficiently (in polynomial time) by a digital computer. From this assumption and the assumption that P ≠ NP we can draw conclusions about the operation of physical devices used for computation. An NP-comple...
متن کاملRandom matrix theory for the analysis of the performance of an analog computer: a scaling theory
The phase space flow of a dynamical system, leading to the solution of linear programming (LP) problems, is explored as an example of complexity analysis in an analog computation framework. In this framework, computation by physical devices and natural systems, evolving in continuous phase space and time (in contrast to the digital computer where these are discrete), is explored. A Gaussian ens...
متن کاملUniversal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?
Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2007
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2007.06.032